Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Documentation: Fix typo in TSP description #645

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

NotAProton
Copy link

Summary

  • its -> his
  • Hamilton -> Hamiltonian

Details and comments

The objective in this case is to find the shortest path that would enable the salesman to visit all the cities and return to his hometown

A Hamiltonian cycle is a closed path that uses every vertex of a graph once.

- its -> his
- Hamilton -> Hamiltonian
@CLAassistant
Copy link

CLAassistant commented Nov 13, 2024

CLA assistant check
All committers have signed the CLA.

@coveralls
Copy link

Pull Request Test Coverage Report for Build 11825632387

Details

  • 0 of 0 changed or added relevant lines in 0 files are covered.
  • No unchanged relevant lines lost coverage.
  • Overall coverage remained the same at 92.857%

Totals Coverage Status
Change from base Build 11829472558: 0.0%
Covered Lines: 4446
Relevant Lines: 4788

💛 - Coveralls

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants